Temporal Link Prediction Using Matrix and Tensor Factorizations
نویسندگان
چکیده
منابع مشابه
V n ) LINK INVARIANT AND MATRIX FACTORIZATIONS
M. Khovanov and L. Rozansky gave a categorification of the HOMFLY-PT polynomial. This study is a generalization of the Khovanov-Rozansky homology. We define a homology associated to the quantum (sln,∧Vn) link invariant, where ∧Vn is the set of the fundamental representations of the quantum group of sln. In the case of a [1, k]-colored link diagram, we prove that its homology is a link invariant...
متن کاملTurbo-SMT: Parallel coupled sparse matrix-Tensor factorizations and applications
How can we correlate the neural activity in the human brain as it responds to typed words, with properties of these terms (like 'edible', 'fits in hand')? In short, we want to find latent variables, that jointly explain both the brain activity, as well as the behavioral responses. This is one of many settings of the Coupled Matrix-Tensor Factorization (CMTF) problem. Can we enhance any CMTF sol...
متن کاملAll-at-once Optimization for Coupled Matrix and Tensor Factorizations
Joint analysis of data from multiple sources has the potential to improve our understanding of the underlying structures in complex data sets. For instance, in restaurant recommendation systems, recommendations can be based on rating histories of customers. In addition to rating histories, customers’ social networks (e.g., Facebook friendships) and restaurant categories information (e.g., Thai ...
متن کاملMATRIX FACTORIZATIONS AND DOUBLE LINE IN sln QUANTUM LINK INVARIANT
L. Kauffman introduced a graphical link invariant which is the normalized Jones polynomial [4][5]. It is well-known that the polynomial is derived from the fundamental representation of the quantum group Uq(sl2). Further, G. Kuperberg constructed a graphical link invariant associated with the fundamental representation of the quantum group Uq(sl3) [10]. H. Murakami, T. Ohtsuki and S. Yamada int...
متن کاملScalable Boolean Tensor Factorizations using Random Walks
Tensors are becoming increasingly common in data mining, and consequently, tensor factorizations are becoming more and more important tools for data miners. When the data is binary, it is natural to ask if we can factorize it into binary factors while simultaneously making sure that the reconstructed tensor is still binary. Such factorizations, called Boolean tensor factorizations, can provide ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Knowledge Discovery from Data
سال: 2011
ISSN: 1556-4681,1556-472X
DOI: 10.1145/1921632.1921636